A Comparative Study on Adjunct Array Token Petri Nets with Some Classes of Array Grammars
نویسنده
چکیده
Adjunct Array Token Petri Net Structures (AATPNS) are recently introduced rectangular picture generating devices which extended the Array token Petri net Structures. AATPNS generated context free and context sensitive kolam array languages and tabled 0L/1L languages. In this paper we compare AATPNS with some simple and expressive picture grammar models like extended pure 2D context-free grammars, Internal parallel contextual array grammars, indexed Siromoney matrix grammars and CR Image grammars for examining further generating capacity of this model.
منابع مشابه
Adjunct Hexagonal Array Token Petri Nets and Hexagonal Picture Languages
Adjunct Hexagonal Array Token Petri Net Structures (AHPN) are recently introduced hexagonal picture generating devices which extended the Hexagonal Array Token Petri Net Structures . In this paper we consider AHPN model along with a control feature called inhibitor arcs and compare it with some expressive hexagonal picture generating and recognizing models with respect to the generating power.
متن کاملAn Application of Array Token Petri Nets to Clustering Analysis for Syntactic Patterns
H. Fernau, R. Freund and M. Holzer, Character recognition with k-head finite array automata, Advances in Pattern Recognition, Lecture Notes in Computer Science, 1998, Volume 1451, pp 282-291. H. Fernau and R. Freund, Bounded Parallelism in Array Grammars used for Character Recognition, Advances in Structural and Syntactical Pattern Recognition, Lecture Notes in Computer Science, 1996, Volume 11...
متن کاملOn Some Special Classes of Sonnenschein Matrices
In this paper we consider the special classes of Sonnenschein matrices, namely the Karamata matrices $K[alpha,beta]=left(a_{n,k}right)$ with the entries [{a_{n,k}} = sumlimits_{v = 0}^k {left( begin{array}{l} n\ v end{array} right){{left( {1 - alpha - beta } right)}^v}{alpha ^{n - v}}left( begin{array}{l} n + k - v - 1\ ,,,,,,,,,,k...
متن کاملPetri Net Controlled Grammars: the Case of Special Petri Nets
A Petri net controlled grammar is a context-free grammar equipped with a Petri net, whose transitions are labeled with rules of the grammar or the empty string, and the associated language consists of all terminal strings which can be derived in the grammar and the the sequence of rules in every terminal derivation corresponds to some occurrence sequence of transitions of the Petri net which is...
متن کاملSoccer Goalkeeper Task Modeling and Analysis by Petri Nets
In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013